A Flexible, Prime-Field, Genus 2 Hyperelliptic- Curve Cryptography Processor with Low Power Consumption and Uniform Power Draw

نویسندگان

  • Hamid-Reza Ahmadi
  • Ali Afzali-Kusha
  • Massoud Pedram
  • Mahdi Mosaffa
چکیده

prime-field hyperelliptic-curve cryptography (HECC) processor with uniform power draw. The HECC processor performs divisor scalar multiplication on the Jacobian of genus 2 hyperelliptic curves defined over prime fields for arbitrary field and curve parameters. It supports the most frequent case of divisor doubling and addition. The optimized implementation, which is synthesized in a 0.13 mm standard CMOS technology, performs an 81-bit divisor multiplication in 503 ms consuming only 6.55 mJ of energy (average power consumption is 12.76 mW.) We also present a technique to make the power consumption of the HECC processor more uniform and lower the peaks of its power consumption.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Special Hyperelliptic Curve Cryptosystems of Genus Two: Efficient Arithmetic and Fast Implementation

There exists a manifold variety of cryptographic applications: from low level embedded crypto implementations up to high end cryptographic engines for servers. The latter require a flexible implementation of a variety of cryptographic primitives in order to be capable of communicating with several clients. On the other hand, on the client it only requires an implementation of one specific algor...

متن کامل

A power-optimized low-energy elliptic-curve crypto-processor

This paper presents a low-energy prime-field elliptic-curve cryptography (ECC) hardware processor, suitable for low-power and/or energy-efficient applications and systems. The ECC processor is obtained by power-optimizing a previously reported design. The optimization is performed by making the power consumption profile of the processor as uniform as possible, in an attempt to increase the seco...

متن کامل

Efficient explicit formulae for genus 3 hyperelliptic curve cryptosystems over binary fields

The ideal class groups of hyperelliptic curves(HECs) can be used in cryptosystems based on the discrete loga-rithm problem. Recent developments of computational technolo-gies for scalar multiplications of divisor classes have shown thatthe performance of hyperelliptic curve cryptosystems (HECC) iscompatible to that of elliptic curve cryptosystems (ECC). Espe-cially, genu...

متن کامل

Comparative Analysis of Higher Genus Hyperelliptic Curve Cryptosystems over Finite Field Fp

The performance analysis of Hyperelliptic Curve Cryptosystems (HECC) over prime fields (Fp) of genus 5 and 6 are discussed in this paper. We have implemented a HECC system of genus 5 & 6 in a Intel Pentium III Celeron Processor @ 933 MHz speed with 256 MB RAM in Java 1.5. We have also compared their efficiency on the parameters of time taken for divisor generation, key generation, encryption an...

متن کامل

Comparative Study of Hyperelliptic Curve Cryptosystem over Prime Field and Its Survey

Public key cryptography is the famous cryptography technique used in many corporate sectors for developing software to provide security services. Hyperelliptic Curve Cryptosystem (HECC) is one of the public key cryptographic technique, an expansion of Elliptic Curve Cryptography which offers the similar level of security compared with other cryptosystems such as RSA, ECC and DSA. HECC supervise...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014